Studying Pensions Funds Through an Infinite Servers Nodes Network: A Theoretical Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identification of malicious nodes in an AODV pure ad hoc network through guard nodes

This paper presents a guard node based scheme to identify malicious nodes in Ad hoc on-Demand Vector (AODV) protocol. Each node calculates trust level of its neighboring nodes for route selection. Trust calculation process involves opinions of other nodes about the node whose trust level is to be determined. If a neighboring node has a trust level lower than predefined threshold value. it’s ide...

متن کامل

Infinite solutions having a prescribed number of nodes for a Schrödinger problem

*Correspondence: [email protected] School of Mathematics and Computer Sciences, Fujian Normal University, Fuzhou, 350007, P.R. China Abstract In this paper, we are concerned with the multiplicity of solutions for a Schrödinger problem. A weaker super-quadratic assumption is required for the nonlinearity. Then we give a new proof for the infinite solutions to the problem, having a prescribed ...

متن کامل

Flux in an Infinite Network

In an infinite network, we introduce the notion of flux which is an important concept in the study of many physical problems. The basic tool needed, namely the discrete version of the Green’s formula, is proved here in a generalized form.

متن کامل

Delay Bound: Fractal Traffic Passes through Network Servers

andApplied Analysis Hindawi Publishing Corporationhttp://www.hindawi.comVolume 2013 ISRNAppliedMathematics Hindawi Publishing Corporationhttp://www.hindawi.comVolume 2013Hindawi Publishing Corporationhttp://www.hindawi.comVolume 2013International Journal ofCombinatorics Hindawi Publishing Corporationhttp://www.hindawi.comVolume 2013Jou...

متن کامل

Tollbooth tandem queues with infinite homogeneous servers

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before himlher have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2012

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/394/1/012035